Terminating Tableau Systems for Modal Logic with Equality
نویسندگان
چکیده
The paper presents two terminating tableau systems for hybrid logic with the difference modality. Both systems are based on an abstract treatment of equality. They expand formulas with respect to a congruence closure that is not represented explicitly. The first system employs pattern-based blocking. The second system employs chain-based blocking and covers converse modalities. Both systems can handle transitive relations.
منابع مشابه
Terminating Tableau Systems for Hybrid Logic with Difference and Converse
This paper contributes to the principled construction of terminating tableau systems for modal logic with nominals and difference modalities [4, 1, 8, 11]. We also consider global and converse modalities and reflexive and transitive relations. Nominals and difference enrich modal logic with equational constraints, and handling these constraints in a terminating tableau system is the main challe...
متن کاملTerminating Tableau Calculi for Hybrid Logics Extending K
This article builds on work by Bolander and Blackburn [7] on terminating tableau systems for the minimal hybrid logic K. We provide (for the basic uni-modal hybrid language) terminating tableau systems for a number of non-transitive hybrid logics extending K, such as the logic of irreflexive frames, antisymmetric frames, and so on; these systems don’t employ loop-checks. We also provide (for hy...
متن کاملTerminating tableau calculi for modal logic K with global counting operators
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...
متن کاملTerminating modal tableaux with simple completeness proof
In this paper we study formal tools for the definition of tableaux systems for modal logics. We begin by some preliminaries about graphs. Then we present graph rewriting rules together with control constructs for defining strategies of application of these rules. We establish fair strategies that are sound, complete and terminating. These results cover almost all basic modal logics such as K, T...
متن کاملModal Tableau Systems with Blocking and Congruence Closure
Our interest in this paper are semantic tableau approaches closely related to bottom-up model generation methods. Using equalitybased blocking techniques these can be used to decide logics representable in first-order logic that have the finite model property. Many common modal and description logics have these properties and can therefore be decided in this way. This paper integrates congruenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008